Decomposition of perturbed Chebyshev polynomials

We characterize polynomial decomposition fn = r ◦ q with r, q ∈ C[x] of perturbed Chebyshev polynomials defined by the recurrence f0(x) = b, f1(x) = x− c, fn+1(x) = (x− d)fn(x)− afn−1(x), n ≥ 1, where a, b, c, d ∈ R and a > 0. These polynomials generalize the Chebyshev polynomials, which are obtained by setting a = 1/4, c = d = 0 and b ∈ {1, 2}. At the core of the method, two algorithms for polynomial decomposition are provided, which allow to restrict the investigation to the resolution of six systems of polynomial equations in three variables. The final task is then carried out by the successful computation of reduced Gröbner bases with Maple 10. Some additional data for the calculations are available on the author’s web page.